https://ogma.newcastle.edu.au/vital/access/ /manager/Index ${session.getAttribute("locale")} 5 https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:34598 Tue 02 Apr 2019 11:20:15 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:19330 Thu 06 Aug 2015 10:47:12 AEST ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:8162 Sat 24 Mar 2018 08:36:06 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:14049 Sat 24 Mar 2018 08:22:37 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:11199 Sat 24 Mar 2018 08:13:36 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:11375 Sat 24 Mar 2018 08:11:55 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:11492 Sat 24 Mar 2018 08:10:25 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:21172 Sat 24 Mar 2018 07:58:04 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:29690 (a,d)-edge antimagic total labeling of a (p, q)-graph G is bijection f:V∪E→{1,2,3,…,p+q} with the property that the edge-weights w(uv)=f(u)+f(v)+f(uv) where uv∈E(G) form an arithmetic progression a,a+d,…,a+(q−1)d, where a > 0 and d ≥ 0 are two fixed integers. If such a labeling exists, then G is called an (a,d)-edge antimagic total graph. If further the vertex labels are the integers {1,2,3,…,p}, then f is called a super (a,d)-edge antimagic total labeling of G ((a, d)-SEAMT labeling) and a graph which admits such a labeling is called a super (a,d)-edge antimagic total graph ((a, d)-SEAMT graph). If d=0, then the graph G is called a super edge-magic graph. In this paper we investigate the existence of super (a, 3)-edge antimagic total labelings for union of two stars.]]> Sat 24 Mar 2018 07:38:47 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:36061 Mon 03 Feb 2020 13:58:08 AEDT ]]>